From Relational Data to RDFS Models

نویسندگان

  • Maksym Korotkiy
  • Jan L. Top
چکیده

A vast amount of information sources is stored as relationallike data and inaccessible to RDFS-based systems. In this paper we describe an approach to integration such information sources with RDFSaware systems. The proposed solution is purely RDFS-based. We use RDF/S as a mechanism to specify and perform linking of relational data and a predefined domain ontology. The approach is transformation-free, therefore, it completely preserves the original structure of relational data and eliminates the need for a run-time transformation component. This ensures that all the data is accessible and usable in consistence with the original data model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Querying RDF Schema Views of Relational Databases

Petrini, J. 2008. Querying RDF Schema Views of Relational Databases. Acta Universitatis Upsaliensis. Uppsala Dissertations from the Faculty of Science and Technology 75. 117 pp. Uppsala. ISBN 978-91-554-7202-3. The amount of data found on the web today and its lack of semantics makes it increasingly harder to retrieve a particular piece of information. With the Resource Description Framework (R...

متن کامل

Efficient evaluation of SPARQL over RDFS graphs

Evaluating queries over RDFS is currently done by computing the closure, which is quadratic in the worst case. In this paper, we show how to evaluate SPARQL over RDFS graphs by using a navigational language grounded in standard relational algebra with operators for navigating triples with regular constraints. In particular, we show that there is a fragment of this language with linear time data...

متن کامل

Semantics of Constraints in RDFS

We study constraints for RDF-Schema (RDFS) graphs. The syntax and semantics is defined for constraints in graphs that can contain RDFS properties and blank nodes. The proposal for constraint satisfaction closely resembles the possible world approach found in various contexts of incomplete databases and knowledge bases. Positive decidability results for checking satisfaction of RDFS constraints ...

متن کامل

Dynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes

RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently a W3C standard for querying RDF data, but it mostly provides means for querying simple RDF graphs only, whereas querying with respect to RDFS or other entailment regimes is left outside the current specification. In t...

متن کامل

Annotation algebras for RDFS

Provenance and annotation are intimately connected. On the one hand provenance can be regarded as a form of annotation, on the other hand, in order to understand how to convey annotations from source data to derived data, we need an account of how the data was derived – its provenance. Following a successful line of database research in which elements of a database are annotated with algebraic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004